Average D-Distance Between Edges of a Graph

The Maximum Number of Edges in a Strongly Multiplicative Graph

Average distance , radius and remoteness of a graph ∗

Let G = (V,E) be a connected graph on n vertices. Denote by l̄(G) the average distance between all pairs of vertices in G. The remoteness ρ(G) of a connected graph G is the maximum average distance from a vertex of G to all others. The aim of this paper is to show that two conjectures in [5] concerned with average distance, radius and remoteness of a graph are true.

Different-Distance Sets in a Graph

A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...

the maximum number of edges in a strongly multiplicative graph

0

On Approximating the Average Distance Between